Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/TRCSRSLASHEx4_Zan97

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__g₁(X)) -> G₁(activate₁(X))
SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))
ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)
G₁(s₁(X)) -> G₁(X)
ACTIVATE₁(n__f₁(X)) -> F₁(activate₁(X))
ACTIVATE₁(n__f₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> ACTIVATE₁(Z)
ACTIVATE₁(n__g₁(X)) -> G₁(activate₁(X))
SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))
ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)
G₁(s₁(X)) -> G₁(X)
ACTIVATE₁(n__f₁(X)) -> F₁(activate₁(X))
ACTIVATE₁(n__f₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 3 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G₁(s₁(X)) -> G₁(X)

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

G₁(s₁(X)) -> G₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
G₁(x1) = G₁(x1)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > G₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)
ACTIVATE₁(n__f₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVATE₁(n__f₁(X)) -> ACTIVATE₁(X)

The remaining pairs can at least by weakly be oriented.

ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)

Used ordering: Combined order from the following AFS and order.
ACTIVATE₁(x1) = ACTIVATE₁(x1)
n__g₁(x1) = x1
n__f₁(x1) = n__f₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVATE₁(n__g₁(X)) -> ACTIVATE₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
ACTIVATE₁(x1) = ACTIVATE₁(x1)
n__g₁(x1) = n__g₁(x1)

Lexicographic Path Order [19].
Precedence:

n_{_g₁} > ACTIVATE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))

The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

SEL₂(s₁(X), cons₂(Y, Z)) -> SEL₂(X, activate₁(Z))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
SEL₂(x1, x2) = SEL₂(x1, x2)
s₁(x1) = s₁(x1)
cons₂(x1, x2) = x2
activate₁(x1) = activate₁(x1)
n__f₁(x1) = n__f
f₁(x1) = f
n__g₁(x1) = n__g₁(x1)
g₁(x1) = g₁(x1)
0 = 0

Lexicographic Path Order [19].
Precedence:

SEL₂ > [activate₁, n_{_f}, f] > [g₁, 0] > s₁ > n_{_g₁}

The following usable rules [14] were oriented:

activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
g₁(X) -> n__g₁(X)
f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
f₁(X) -> n__f₁(X)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₁(X) -> cons₂(X, n__f₁(n__g₁(X)))
g₁(0) -> s₁(0)
g₁(s₁(X)) -> s₁(s₁(g₁(X)))
sel₂(0, cons₂(X, Y)) -> X
sel₂(s₁(X), cons₂(Y, Z)) -> sel₂(X, activate₁(Z))
f₁(X) -> n__f₁(X)
g₁(X) -> n__g₁(X)
activate₁(n__f₁(X)) -> f₁(activate₁(X))
activate₁(n__g₁(X)) -> g₁(activate₁(X))
activate₁(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.